Distributed algorithms for random graphs

Random Graphs for Peer-to-Peer Overlays

Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, ressource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algori...

DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

Probabilistic Aspects of Computer Science: Distributed Algorithms and Random Graphs

Colouring random graphs and maximising local diversity

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat are adapted to carry out this task. We present experimental results based on two types of rand...

Mean Square Performance of Consensus-Based Distributed Estimation over Regular Geometric Graphs

Abstract. Average-consensus algorithms allow to compute the average of some agents’ data in a distributed way, and they are used as a basic building block in many algorithms for distributed estimation, load balancing, formation and distributed control. Traditional analysis of such algorithms studies, for a given communication graph, the convergence rate (second largest eigenvalue of the transit...